Limits on jump inversion for strong reducibilities

نویسندگان

  • Barbara F. Csima
  • Rodney G. Downey
  • Keng Meng Ng
چکیده

We show that Sacks’ and Shoenfield’s analogs of jump inversion fail for both ttand wttreducibilities in a strong way. In particular we show that there is a ∆2 set B >tt ∅ ′ such that there is no c.e. set A with A′ ≡wtt B . We also show that there is a Σ 0 2 set C >tt ∅ ′ such that there is no ∆2 set D with D′ ≡wtt C . §

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Workshop in Computability Theory Paris - July 2010

A pair of sets of natural numbers A and B forms a K-pair if there exists a c.e. set W , such that A × B ⊆ W and A × B ⊆ W . Kpairs are introduced by Kalimullin and used by him to prove the first order definability of the enumeration jump operator in the global structure of the enumeration degrees. He shows that the property of being a K-pair is degree theoretic and first order definable in the ...

متن کامل

Computability, Traceability and Beyond

This thesis is concerned with the interaction between computability and randomness. In the first part, we study the notion of traceability. This combinatorial notion has an increasing influence in the study of algorithmic randomness. We prove a separation result about the bounds on jump traceability, and show that the index set of the strongly jump traceable computably enumerable (c.e.) sets is...

متن کامل

Strong and Robustly Strong Polynomial Time Reducibilities to Sparse Sets

GavaldB, R. and J.L. BalcBzar, Strong and robustly strong polynomial time reducibilities to sparse sets, Theoretical Computer Science 88 (1991) I-14. Reducibility defined by oracle strong nondeterministic machines is studied. Two definitions of relativized strength are presented and separated. The corresponding reduction classes of the sparse sets give two nonuniform analogs of the class NPncoN...

متن کامل

On the Symmetric Enumeration Degrees

A set A is symmetric enumeration (se-) reducible to a set B (A≤seB) if A is enumeration reducible to B and A is enumeration reducible to B. This reducibility gives rise to a degree structure (Dse) whose least element is the class of computable sets. We give a classification of ≤se in terms of other standard reducibilities and we show that the natural embedding of the Turing degrees (DT) into th...

متن کامل

تأثیر دو نوع متفاوت تیپ بر نیروی برشی قدامی زانو حین پرش- فرود تک‌پا در والیبالیست‌های مرد نخبه با پیچ‌خوردگی مزمن خارجی مچ پا

Background: Today, different types of tapes used for prevention and treatment of chronic inversion ankle sprain. The purpose of current study was to investigate the effect of two different tapes (white and Kinesio tape) on peak knee anterior shear force during landing after the jump among elite volleyball players with chronic inversion ankle sprain. Methods: In this semi- experimental study,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Symb. Log.

دوره 76  شماره 

صفحات  -

تاریخ انتشار 2011